Counting Trees in a Phylogenetic Network Is \#P-Complete
نویسندگان
چکیده
Answering a problem posed by Nakhleh, we prove that counting the number of phylogenetic trees inferred by a (binary) phylogenetic network is #P-complete. An immediate consequence of this result is that counting the number of phylogenetic trees commonly inferred by two (binary) phylogenetic networks is also #P-complete.
منابع مشابه
Counting consistent phylogenetic trees is #P-complete
Reconstructing phylogenetic trees is a fundamental task in evolutionary biology. Various algorithms exist for this purpose, many of which come under the heading of ‘supertree methods.’ These methods amalgamate a collection P of phylogenetic trees into a single parent tree. In this paper, we show that, in both the rooted and unrooted settings, counting the number of parent trees that preserve al...
متن کاملApproximately Counting Locally-Optimal Structures
In general, constructing a locally-optimal structure is a little harder than constructing an arbitrary structure, but significantly easier than constructing a globally-optimal structure. A similar situation arises in listing. In counting, most problems are #P-complete, but in approximate counting we observe an interesting reversal of the pattern. Assuming that #BIS is not equivalent to #SAT und...
متن کاملThe Complexity of Counting and Randomised Approximation
In this thesis we examine the complexity of counting, both exactly and approximately. We first consider counting functions in phylogenetics, and prove some intractability results. The main result in this section is that computing the number of rooted binary phylogenetic trees consistent with a given set of rooted triples is #P-complete. We also show that computing the number of consistent roote...
متن کاملGenerating functions for multi-labeled trees
Multi-labeled trees are a generalization of phylogenetic trees that are used, for example, in the study of gene versus species evolution and as the basis for phylogenetic network construction. Unlike phylogenetic trees, in a leaf-multi-labeled tree it is possible to label more than one leaf by the same element of the underlying label set. In this paper we derive formulae for generating function...
متن کاملPhylogenetic analysis of two Iranian grapevine virus A isolates using coat protein gene sequence
Symptomatic grapevine samples were collected from vineyards in Zanjan province to detect Grapevine virus A. Total RNA was extracted from symptomatic leaf samples and subjected to cDNA synthesis using random hexamer primers. Then, a DNA fragment around 800 bp including the complete coat protein (CP) gene was amplified from nine out of 57 samples by polymerase chain reaction (PCR) using specific ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 42 شماره
صفحات -
تاریخ انتشار 2013